End-to-End Delay Guarantees for Multiple-Channel Schedulers
نویسندگان
چکیده
Consider a network in which adjacent nodes exchange messages via multiple communication channels. Multiple channels between adjacent nodes are desirable due to their cost effectiveness and improved fault-tolerance. We consider the problem of providing deterministic quality of service guarantees in this network. We show that any scheduling protocol designed for a single channel can be converted into a multiplechannel scheduling protocol without significantly increasing the delay at the scheduling node. However, because there are multiple channels between adjacent nodes, the packets of a flow may be reordered. This in turn significantly increases the upper bound on the end-to-end delay of the flow. We show how this increase in delay can be avoided through the use of efficient sorting techniques.
منابع مشابه
A Constant Complexity Fair Scheduler with O(log N) Delay Guarantee
Many Internet multimedia applications require the support of network services with fairness and delay guarantees. Currently, there are two types of fair schedulers in the literature. The time stamp based schedulers achieve good fairness and delay guarantees but have high O(log N) time complexity, where N is the number of incoming flows. While the round robin based schedulers reach O(1) complexi...
متن کاملA theory of multi-channel schedulers for quality of service
A computer network consists of a set of computing nodes interconnected via communication channels. It is commonly assumed that, for each pair of network nodes u and v, there is at most one channel from u to v. However, it is often desirable to have multiple channels between nodes. That is, for every pair of network nodes u and v, there may be multiple channels from u to v. In this paper, we con...
متن کاملProviding End-to-End Statistical Delay Guarantees in cascades of Earliest Deadline First schedulers
This paper proposes an analytical method to evaluate the delay violation probability of traffic flows with statistical Quality-of-Service (QoS) guarantees in an Earliest Deadline First (EDF) scheduler. The statistical QoS targets for each service class are expressed in terms of a delay threshold and delay violation probability. We study both cases isolated nodes and end-to-end paths comprisin...
متن کاملEnhanced Bulk Scheduling for Supporting End-to-End Delay Requirements
Providing end-to-end delay guarantees for delay sensitive applications is an important packet scheduling issue of routers. In this paper, to support end-to-end delay requirements, we propose a novel network scheduling scheme, called the Bulk Scheduling Scheme (BSS), built on top of existing schedulers of intermediate nodes without modifying transmission protocols on both sender and receiver sid...
متن کاملFrame-counter scheduler: A novel QoS scheduler for real-time traffic
Real-time traffic communication has Quality of Service (QoS) requirements such as end-to-end bandwidth and delay guarantees. We propose a novel frame-based QoS Scheduler, the frame-counter scheduler, for connection oriented packet switching networks. The frame-counter scheduler significantly reduces the end-to-end delay bound and buffer requirements provided by other frame-based schedulers. A f...
متن کامل